منابع مشابه
The Escape Model on a Homogeneous Tree
There are two types of particles interacting on a homogeneous tree of degree d + 1. The particles of the first type colonize the empty space with exponential rate 1, but cannot take over the vertices that are occupied by the second type. The particles of the second type spread with exponential rate λ. They colonize the neighboring vertices that are either vacant or occupied by the representativ...
متن کاملa study on insurer solvency by panel data model: the case of iranian insurance market
the aim of this thesis is an approach for assessing insurer’s solvency for iranian insurance companies. we use of economic data with both time series and cross-sectional variation, thus by using the panel data model will survey the insurer solvency.
Rate of Escape on the Lamplighter Tree
Suppose we are given a homogeneous tree Tq of degree q ≥ 3, where at each vertex sits a lamp, which can be switched on or off. This structure can be described by the wreath product (Z/2) ≀ Γ, where Γ = ∗ i=1 Z/2 is the free product group of q factors Z/2. We consider a transient random walk on a Cayley graph of (Z/2) ≀ Γ, for which we want to compute lower and upper bounds for the rate of escap...
متن کاملThe universal homogeneous binary tree
A partial order is called semilinear iff the upper bounds of each element are linearly ordered and any two elements have a common upper bound. There exists, up to isomorphism, a unique countable semilinear order which is dense, unbounded, binary branching, and without joins, which we denote by (S2;≤). We study the reducts of (S2;≤), that is, the relational structures with domain S2, all of whos...
متن کاملMemory-aware tree partitioning on homogeneous platforms
Scientific applications are commonly modeled as the processing of directed acyclic graphs of tasks, and for some of them, the graph takes the special form of a rooted tree. This tree expresses both the computational dependencies between tasks and their storage requirements. The problem of scheduling/traversing such a tree on a single processor to minimize its memory footprint has already been w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Communications in Probability
سال: 2005
ISSN: 1083-589X
DOI: 10.1214/ecp.v10-1140